package com.yan_jiu_sheng.LeetCodeHot100;

/**
 * https://leetcode.cn/problems/binary-tree-maximum-path-sum/description/?envType=study-plan-v2&envId=top-100-liked
 * 树 动态规划 深度优先遍历
 * 动态规划先往后放放
 *
 * @author yulongTian
 * @create 2024-06-27 13:14
 */
public class Test50 {
    public static void main(String[] args) {

    }


    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    public int maxPathSum(TreeNode root) {

        return 0;
    }


}
